Firing Sequences Estimation for Timed Petri Nets
نویسنده
چکیده
This work deals with the firing sequences estimation for transitions timed Petri nets by measurement of the places marking. Firing durations are unknown, but supposed not to be null. In fact, the Petri net marking is measured, on line, with a sampling period ∆t small enough such that each transition is fired, at the most, one time during ∆t. The estimation problem has exact and approximated solutions that are described. Sufficient conditions are given on the accuracy of the marking measurement, such that the estimation of the firing sequences is an exact one. If the estimation provides several solutions, the Petri net is completed in order to give a unique solution.
منابع مشابه
Using Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملA rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملAlgebras of Processes of Timed Petri Nets
Processes of timed Petri nets are represented by labelled partial orders with some extra features. These features reflect the execution times of processes and allow to combine processes sequentially and in parallel. The processes can be represented either without specifying when particular situations appear (free time-consuming processes), or together with the respective appearance times (timed...
متن کاملTiPeNeSS: a timed petri net simulator software with generally distributed firing delays
Performance analysis can be carried out in several ways, especially in case of Markovian models. In order to interpret high level of abstraction, we often use modeling tools like timed Petri nets (TPNs). Although some subclasses of TPNs (e.g. stochastic Petri nets (SPNs) [17, 19]) can be handled analytically, a general timed Petri net is hard to evaluate via numerical analysis. However, the sim...
متن کاملM–timed Petri Nets, Priorities, Preemptions, and Performance Evaluation of Systems
In M–timed Petri nets, firing times are exponentially distributed random variables associated with transitions of a net. Several classes of M–timed Petri nets are discussed in this paper to show increasing “modelling power” of different nets. Conflict–free nets can model M and Ek–type queueing systems. Free—choice nets can also represent Hk–type systems. Systems with several classes of users an...
متن کامل